Aplicaciones del Caos y la Complejidad en la Cadena de Suministros del Sector Agroindustrial

La presente investigación consiste en determinar las aplicaciones existentes de las teorías del caos y las teorías de la complejidad en la cadena de suministro del sector agroindustrial colombiano. Además, tiene como propósito describir el sector de la agroindustria y la cadena de suministro, identificar los modelos de caos y complejidad y posteriormente determinar cuáles de éstos son aplicables al sector. Se define el caos como una sub-disciplina de las matemáticas que estudia sistemas complejos o dinámicos y tiene inmerso implicaciones filosóficas; por otra parte complejidad es la cualidad que adquiere un sistema en el que hay diversos componentes relacionados. Se ha identificado que en el ámbito colombiano existen diferentes estudios enfocados en la construcción de modelos agroindustriales, donde se adopta el concepto de complejidad para calificar el atributo de dichos modelos que involucran la armonización e integración de diferentes actores, desde los productores hasta los consumidores. En este estudio se emplea un estudio monográfico de tipo documental teniendo como unidad de análisis la cadena de suministro del sector agroindustrial. Los resultados indican que las teorías del caos y complejidad se encuentran presentes dentro de la cadena de suministros del sector agroindustrial colombiano, ya que en ella se ocurre la interconexión entre productores, procesadores y comercializadores, interactuando entre ellos y presentando alteraciones en su comportamiento económico a lo largo del tiempo en función de variaciones de las condiciones iniciales influenciadas por variables macroeconómicas, ambientales, sociales y políticas.This project intends to identify the existing applications of chaos and complexity theories in the supply chain of the Colombian agribusiness sector. Furthermore, the specific objectives are to achieve the description of the agribusiness sector and its supply chain, identify models of chaos and complexity and determine which of these are applicable to the sector. Chaos is a sub-discipline of mathematics that studies complex and dynamic systems and has immersed philosophical and mathematical implications, while the complexity is the quality that becomes a system in which there are many related components. It will be a monograph about the supply chain of the agribusiness sector. In the Colombian context there have been various studies focused on building agribusiness models, where the concept of complexity is adopted to qualify the attribute of these models involving the harmonization and integration of the different actors, from producers to consumers. This project aims to identify existing applications of chaos and complexity in the supply chain of the Colombian agribusiness sector. This paper is in the Finance & Marketing line of investigation, in the project of Corporate Finance. As final result, it’s found that theories of chaos and complexity are present in the supply chain of the Colombian agribusiness sector because there is an interconnection between producers, industrials and dealers, interacting with each other and showing alterations on their economic behavior over the time depending on variations on initial conditions influenced by macroeconomic, environmental, social and political variables.Universidad del Rosari

Language-independent link key-based data interlinking

david2015aInternational audienceLinks are important for the publication of RDF data on the web. Yet, establishing links between data sets is not an easy task. We develop an approach for that purpose which extracts weak link keys. Link keys extend the notion of a key to the case of different data sets. They are made of a set of pairs of properties belonging to two different classes. A weak link key holds between two classes if any resources having common values for all of these properties are the same resources. An algorithm is proposed to generate a small set of candidate link keys. Depending on whether some of the, valid or invalid, links are known, we define supervised and non supervised measures for selecting the appropriate link keys. The supervised measures approximate precision and recall, while the non supervised measures are the ratio of pairs of entities a link key covers (coverage), and the ratio of entities from the same data set it identifies (discrimination). We have experimented these techniques on two data sets, showing the accuracy and robustness of both approaches

Data interlinking through robust linkkey extraction

International audienceLinks are important for the publication of RDF data on the web. Yet, establishing links between data sets is not an easy task. We develop an approach for that purpose which extracts weak linkkeys. Linkkeys extend the notion of a key to the case of different data sets. They are made of a set of pairs of properties belonging to two different classes. A weak linkkey holds between two classes if any resources having common values for all of these properties are the same resources. An algorithm is proposed to generate a small set of candidate linkkeys. Depending on whether some of the, valid or invalid, links are known, we define supervised and non supervised measures for selecting the appropriate linkkeys. The supervised measures approximate precision and recall, while the non supervised measures are the ratio of pairs of entities a linkkey covers (coverage), and the ratio of entities from the same data set it identifies (discrimination). We have experimented these techniques on two data sets, showing the accuracy and robustness of both approaches

Algebraic calculi for weighted ontology alignments

inants2016bInternational audienceAlignments between ontologies usually come with numerical attributes expressing the confidence of each correspondence. Semantics supporting such confidences must generalise the semantics of alignments without confidence. There exists a semantics which satisfies this but introduces a discontinuity between weighted and non-weighted interpretations. Moreover, it does not provide a calculus for reasoning with weighted ontology alignments. This paper introduces a calculus for such alignments. It is given by an infinite relation-type algebra, the elements of which are weighted taxonomic relations. In addition, it approximates the non-weighted case in a continuous manner

Diagnóstico para mejorar los procesos de gestión de proyectos de la empresa A2 ARQUITECTURA S.A.S

Trabajo de gradoMediante la aplicación de los conocimientos adquiridos en la gerencia de obras, se realiza un diganóstico de la empresa en estudio con el fin de conocer el estado actual en cuanto a la gestión de proyectos y los benéficos que obtendría la empresa si se implementa una metodología para la gestión de proyecto como la de PMBOK 6ta Edición.INTRODUCCIÓN 1. GENERALIDADES 2. LEVANTAMIENTO DE INFORMACIÓN 3. CONCLUSIONES 4. RECOMENDACIONES BIBLIOGRAFÍA ANEXOSEspecializaciónEspecialista en Gerencia de Obras Civile

Evaluación – Prueba de Habilidades Prácticas CCNA.

En el presente trabajo de habilidades practicas encontrara, una serie de imágenes que son las evidencias de la configuración de la topología propuesta por la guía, en ella encontrara la configuración de cada uno de los dispositivos que la componen, encontrara los dispositivos conectados con los diferentes medios Físicos Utilizados para el buen funcionamiento de conectividad, encontrara los pantallazos de los comandos utilizados para la configuración de los diferentes Switch y Router, las VLAN utilizadas, el protocolo OSPF configurado y las diferentes interfaces de los dispositivos debidamente Configurados.In the present work of practical skills you will find, a series of images that are the evidences of the configuration of the topology proposed by the guide, in it you will find the configuration of each one of the devices that compose it, you will find the devices connected with the different ones Physical means Used for the proper functioning of connectivity, you will find the screenshots of the commands used for the configuration of the different switches and routers, the VLANs used, the configured OSPF protocol and the different interfaces of the properly configured devices

Prueba de habilidades Prácticas CCNA.

Documento PDF con imagenes de la simulaciónEn la practicas encontrara, una serie de imágenes que son las evidencias de la configuración de la topología propuesta por la guía, en ella encontrara la configuración de cada uno de los dispositivos que la componen, encontrara los dispositivos conectados con los diferentes medios Físicos Utilizados para el buen funcionamiento de conectividad, encontrara los pantallazos de los comandos utilizados para la configuración de los diferentes Switch y Router, las VLAN utilizadas, el protocolo OSPF configurado y las diferentes interfaces de los dispositivos debidamente Configurados.In practice you will find a series of images that are the evidences of the topology configuration proposed by the guide, in it you will find the configuration of each one of the devices that compose it, you will find the devices connected with the different physical means used for the good functioning of connectivity, you will find the screenshots of the commands used for the configuration of the different switches and routers, the VLANs used, the configured OSPF protocol and the different interfaces of the properly configured devices

Reasoning for the description logic ALC with link keys

Data interlinking is a critical task for widening and enhancing linked open data. One way to tackle data interlinking is to use link keys, which generalise keys to the case of two RDF datasets described using different ontologies. Link keys specify pairs of properties to compare for finding same-as links between instances of two classes of two different datasets. Hence, they can be used for finding links. Link keys can also be considered as logical axioms just like keys, ontologies and ontology alignments. We introduce the logic ALC+LK extending the description logic ALC with link keys. It may be used to reason and infer entailed link keys that may be more useful for a particular data interlinking task. We show that link key entailment can be reduced to consistency checking without introducing the negation of link keys. For deciding the consistency of an ALC+LK ontology, we introduce a new tableau-based algorithm. Contrary to the classical ones, the completion rules concerning link keys apply to pairs of individuals not directly related. We show that this algorithm is sound, complete and always terminates

La forma de las emociones: morfología del gesto improvisado

A partir de la indagación teórica de conceptos vinculados al dibujo gestual, tales como el gesto, la sensación y el dibujo como tal, se busca encontrar el vínculo intrínseco entre estos, que confluyen en un dibujo caracterizado por la improvisación, la resistencia a la figuración mediante el gesto expresivo y automático del trazo o la pincelada. Adicionalmente, gracias a una revisión historiográfica desde los orígenes del Dibujo Gestual, se emprende una búsqueda de los caminos a lo largo de la historia del Arte Moderno y Posmoderno. Esta búsqueda termina hallando en la teorización de las características propias del dibujo, el camino para liberarse del plano bidimensional y migrar al plano tridimensional, el campo expandido y el espacio virtual. Como consecuencia, el Dibujo Gestual logra actualizarse, conservando su estética y su origen en el gesto improvisado, ahora en medios, soportes y materiales en el contexto del Arte Contemporáneo.Maestro en Artes Visualespregrad

Language-independent link key-based data interlinking

david2015aInternational audienceLinks are important for the publication of RDF data on the web. Yet, establishing links between data sets is not an easy task. We develop an approach for that purpose which extracts weak link keys. Link keys extend the notion of a key to the case of different data sets. They are made of a set of pairs of properties belonging to two different classes. A weak link key holds between two classes if any resources having common values for all of these properties are the same resources. An algorithm is proposed to generate a small set of candidate link keys. Depending on whether some of the, valid or invalid, links are known, we define supervised and non supervised measures for selecting the appropriate link keys. The supervised measures approximate precision and recall, while the non supervised measures are the ratio of pairs of entities a link key covers (coverage), and the ratio of entities from the same data set it identifies (discrimination). We have experimented these techniques on two data sets, showing the accuracy and robustness of both approaches